Forum: A multiple-conclusion specification logic
نویسندگان
چکیده
منابع مشابه
Forum: A Multiple-Conclusion Specification Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2...
متن کاملForum: a Multiple-conclusion Speciication Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic reenement, Lolli 15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) 2] pr...
متن کاملA Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [12], provide for various forms of abstraction (modules, abstract data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] pr...
متن کاملThe single-conclusion proof logic and inference rules specification
The logic of single-conclusion (functional) proofs (FLP) is introduced. It combines the veri$cation property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that FLP is decidable, sound and complete with respect to arithmetical proof interpretations based on single-valued proof predicate...
متن کاملA Multiple-Conclusion Calculus for First-Order Gödel Logic
We present a multiple-conclusion hypersequent system for the standard first-order Gödel logic. We provide a constructive, direct, and simple proof of the completeness of the cut-free part of this system, thereby proving both completeness for its standard semantics, and the admissibility of the cut rule in the full system. The results also apply to derivations from assumptions (or “non-logical a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00045-x